Tables of maximally equidistributed combined LFSR generators

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tables of maximally equidistributed combined LFSR generators

We give the results of a computer search for maximally equidistributed combined linear feedback shift register (or Tausworthe) random number generators, whose components are trinomials of degrees slightly less than 32 or 64. These generators are fast and have good statistical properties.

متن کامل

Maximally equidistributed combined Tausworthe generators

Tausworthe random number generators based on a primitive trinomial allow an easy and fast implementation when their parameters obey certain restrictions. However, such generators, with those restrictions, have bad statistical properties unless we combine them. A generator is called maximally equidistributed if its vectors of successive values have the best possible equidistribution in all dimen...

متن کامل

Maximally Equidistributed Decimated GFSR Generators

This paper presents generators based on decimated sequences of Generalized Feedback Shift Register (GFSR) generators. The equivalence relation between decimated GFSR generators and Tausworthe generators are presented and a k-distributed initialization scheme is derived. We present decimated GFSR generators that are maximally equidistributed. Timing results of these generators are presented.

متن کامل

Implementing 64-bit Maximally Equidistributed Mersenne Twisters

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than ...

متن کامل

Online Appendix to: Implementing 64-bit Maximally Equidistributed F2-Linear Generators with Mersenne Prime Period

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1999

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-99-01039-x